منابع مشابه
A dependent nominal type theory
Nominal abstract syntax is an approach to representing names and binding pioneered by Gabbay and Pitts. So far nominal techniques have mostly been studied using classical logic or model theory, not type theory. Nominal extensions to simple, dependent and ML-like polymorphic languages have been studied, but decidability and normalization results have only been established for simple nominal type...
متن کاملA Simple Nominal Type Theory
Nominal logic is an extension of first-order logic with features useful for reasoning about abstract syntax with bound names. For computational applications such as programming and formal reasoning, it is desirable to develop constructive type theories for nominal logic that extend standard type theories for propositional, firstor higher-order logic. This has proven difficult, largely because o...
متن کاملSimple nominal type theory
Nominal logic is an extension of first-order logic with features useful for reasoning about abstract syntax with bound names. For computational applications such as programming and formal reasoning, it is desirable to develop constructive type theories for nominal logic which extend standard type theories for propositional, firstor higher-order logic. This has proven difficult, largely because ...
متن کاملA Nominal Theory of Objects with Dependent Types
We design and study νObj, a calculus and dependent type system for objects and classes which can have types as members. Type members can be aliases, abstract types, or new types. The type system can model the essential concepts of Java’s inner classes as well as virtual types and family polymorphism found in BETA or gbeta. It can also model most concepts of SML-style module systems, including s...
متن کاملNominal Presentations of the Cubical Sets Model of Type Theory
The cubical sets model of Homotopy Type Theory was introduced by Bezem, Coquand and Huber using a particular category of presheaves. We show that this category is equivalent to a category of sets whose elements have a finite support property with respect to an action of a monoid of name substitutions; and that this is isomorphic to a category of nominal sets equipped with source and target maps...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logical Methods in Computer Science
سال: 2012
ISSN: 1860-5974
DOI: 10.2168/lmcs-8(1:8)2012